States Graph Generation from dynamic Priority Time Petri Nets
نویسندگان
چکیده
منابع مشابه
States Graph Generation from dynamic Priority Time Petri Nets
dynamic Priority Time Petri Nets (dPTPN) is a mathematical formalism dedicated to modeling Real-Time System (RTS) and checking its schedulability. The present paper proposes a states graph generation from a reduced dPTPN model in order to deal with the scheduling analysis. Based on hierarchical modeling, the present model presents only the interaction between all RTS components and excluding th...
متن کاملHierarchical modeling impact on states graph generation for the dynamic Priority Time Petri Nets
In previous work we have proposed the hierarchical modeling in order to reduce the dynamic priority Time Petri Nets (dPTPN) model. In the present paper, we focus on the demonstration of the impact of this modeling on the generation of a reduced states graph. We aim to explore the abstraction of the hierarchical modeling in order to produce a graph describing only the interaction states of a rea...
متن کاملHierarchical Reachability Graph Generation for Petri Nets
Reachability analysis is the most general approach to the analysis of Petri nets. Due to the wellknown problem of state-space explosion, generation of the reachability set and reachability graph with the known approaches often becomes intractable even for moderately sized nets. This paper presents a new method to generate and represent the reachability set and reachability graph of large Petri ...
متن کاملEssential States in Time Petri Nets
This paper deals with studying the behaviour of Time Petri nets in a discrete way. It is shown that although a continuous time model is used here, only a few time points are important for the determination the behaviour of the net. The computation of the boundedness is shown as a recursive-enumerative process. Qu alitative and quantitative analysis can be done using only the essential states of...
متن کاملAnalysis of Petri Nets with a Dynamic Priority Method
In this paper we propose an eecient reachability set based Petri net analysis by introducing dynamic priorities which decreases the number of reachable markings in most cases. It is proved that for speciic dynamic priority relations certain properties (especially liveness and the existence of home states) do hold if and only if these properties do also hold for the Petri net without priorities....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Open Problems in Computer Science and Mathematics
سال: 2013
ISSN: 1998-6262
DOI: 10.12816/0006172